FFT-Based Preconditioners for Toeplitz-Block Least Squares Problems
نویسندگان
چکیده
منابع مشابه
Block-Toeplitz/Hankel Structured Total Least Squares
A structured total least squares problem is considered in which the extended data matrix is partitioned into blocks and each of the blocks is block-Toeplitz/Hankel structured, unstructured, or exact. An equivalent optimization problem is derived and its properties are established. The special structure of the equivalent problem enables us to improve the computational efficiency of the numerical...
متن کاملNew IMGS-based Preconditioners for Least Squares Problems
Convergence acceleration by preconditioning is usually essential when solving the standard least squares problems by an iterative method. IMGS, is an incomplete modiied version of Gram-Schmidt orthogonalization to obtain an incomplete orthogonal factorization pre-conditioner M = R, where A = Q R + E is an approximation of a QR factorization, Q is an orthogonal matrix and R is upper triangular m...
متن کاملEnhanced Preconditioners for Large Sparse Least Squares Problems
Solving the normal equation systems arising from least-squares problems can be challenging because these systems are often very ill-conditioned. Though the use of iterative methods is appealing for very large problems of this type, preconditioning remains a stumbling block. In this paper we address this issue and describe a number of precondi-tioning strategies. In particular, we discuss a tech...
متن کاملPreconditioners for Least Squares Problems by Lu Factorization
Iterative methods are often suitable for solving least-squares problems minkAx bk2 , where A 2 R n is large and sparse. The use of the conjugate gradient method with a nonsingular square submatrix A1 2 R n of A as preconditioner was first suggested by Läuchli in 1961. This conjugate gradient method has recently been extended by Yuan to generalized least-squares problems. In this paper we consid...
متن کاملPreconditioned Iterative Methods for Weighted Toeplitz Least Squares Problems
We consider the iterative solution of weighted Toeplitz least squares problems. Our approach is based on an augmented system formulation. We focus our attention on two types of preconditioners: a variant of constraint preconditioning, and the Hermitian/skew-Hermitian splitting (HSS) preconditioner. Bounds on the eigenvalues of the preconditioned matrices are given in terms of problem and algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 1993
ISSN: 0036-1429,1095-7170
DOI: 10.1137/0730089